New Binary Sequences Derived from Euler Quotients Modulo pq and Their Generalizations

Pseudorandom sequences with large linear complexity can resist the attack. The trace representation plays an important role in analysis and design of pseudorandom sequences. In this letter, we present construction a family new binary derived from Euler quotients modulo pq, where pq is product two primes p divides q-1. Firstly, are investigated. It proved that have larger attack Berlekamp-Massey algorithm. Then, give proposed by determining corresponding defining pair. Moreover, generalize result to pmqn m≤n. Results indicate generalized still high complexity. We also will be helpful for implementation properties